Aristotle’s Syllogistic as a Deductive System

نویسندگان

چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

The Fuzzy Syllogistic System

A categorical syllogism is a rule of inference, consisting of two premisses and one conclusion. Every premiss and conclusion consists of dual relationships between the objects M, P, S. Logicians usually use only true syllogisms for deductive reasoning. After predicate logic had superseded syllogisms in the 19th century, interest on the syllogistic system vanished. We have analysed the syllogist...

متن کامل

XcelLog: a deductive spreadsheet system

The promise of rule-based computing was to allow end users to create, modify, and maintain applications without the need to engage programmers. But experience has shown that rule sets often interact in subtle ways, making them difficult to understand and reason about. This has impeded the wide-spread adoption of rule-based computing. This paper describes the design and implementation of XcelLog...

متن کامل

DES: A Deductive Database System

This work describes a novel implementation of a deductive database system which fills some gaps other systems do not. In fact, this system was born to this end and since its inception, many new features have been added (null values, outer joins, aggregates, ...). In particular, it embodies both Datalog and SQL query languages, where the same database can be queried. It enjoys an actual interact...

متن کامل

A Deductive Semantic Brokering System

In this paper we study the brokering and matchmaking problem in the tourism domain, that is, how a requester’s requirements and preferences can be matched against a set of offerings collected by a broker. The proposed solution uses the Semantic Web standard of RDF to represent the offerings, and a deductive logical language for expressing the requirements and preferences. We motivate and explai...

متن کامل

A System of Relational Syllogistic Incorporating Full Boolean Reasoning

We present a system of relational syllogistic, based on classical propositional logic, having primitives of the following form: Some a are R-related to some b; Some a are R-related to all b; All a are R-related to some b; All a are R-related to all b. Such primitives formalize sentences from natural language like ‘All students read some textbooks’. Here a, b denote arbitrary sets (of objects), ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Axioms

سال: 2020

ISSN: 2075-1680

DOI: 10.3390/axioms9020056